A Categorification for the Signed Chromatic Polynomial

By coloring a signed graph by colors, one obtains the chromatic polynomial of graph. For each we construct graded cohomology groups whose Euler characteristic yields We show that satisfy long exact sequence which categorifies deletion-contraction rule. This work is motivated Helme-Guizon and Rong's construction categorification for unsigned graphs.